LUCK: Partitioned Processing of Continuous Nearest Neighbor Queries for Moving Objects
نویسندگان
چکیده
We study continuous K nearest neighbor queries over moving objects. LUCK stands for Lazy Update algorithm for processing Continuous K-nearest neighbor queries.
منابع مشابه
Neighbor Queries in Location- Dependent Application
A k nearest neighbor (k-NN) query retrieves k objects in a given objects set which are closest to the query point q. Processing continuous k-nearest neighbor (k-NN) query over moving objects in location-dependent application requires that the frequent location updates of moving objects and intensive continuous k-NN queries must be efficiently processed at the same time. In this paper, we propos...
متن کاملAn Efficient Algorithm for Continuous Nearest Neighbor Queries Based on the VDTPR-tree
With the advances in mobile communication and position-finding technology for tracking the positions of continuously moving objects, there comes a kind of novel applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.) in which the locations of moving objects need to be maintained and processed. In these applications, algorithms for efficiently answering queries invol...
متن کاملMoving Convolutions and Continuous Probabilistic Nearest-Neighbor Queries for Uncertain Trajectories
This report presents our solution to the problem of processing continuous Nearest Neighbor (NN) queries for moving objects trajectories when the exact position of a given object at a particular time instant is not known, but is bounded by an uncertainty region. As has already been observed in the literature, the answers to continuous NN-queries in spatiotemporal settings are time parameterized ...
متن کاملRound-Eye: A system for tracking nearest surrounders in moving object environments
This paper presents ‘‘Round-Eye’’, a system for tracking nearest surrounding objects (or nearest surrounders) in moving object environments. This system provides a platform for surveillance applications. The core part of this system is continuous nearest surrounder (NS) query that maintains views of the nearest objects at distinct angles from query points. This query differs from conventional s...
متن کاملApproximate Continuous K Nearest Neighbor Queries for Continuous Moving Objects with Pre-defined Paths
Continuous K nearest neighbor queries (C-KNN) on moving objects retrieve the K nearest neighbors of all points along a query trajectory. In existing methods, the cost of retrieving the exact C-KNN data set is expensive, particularly in highly dynamic spatio-temporal applications. The cost includes the location updates of the moving objects when the velocities change over time and the number of ...
متن کامل